Paired-domination
نویسندگان
چکیده
منابع مشابه
Total domination versus paired domination
A dominating set of a graph G is a vertex subset that any vertex of G either belongs to or is adjacent to. A total dominating set is a dominating set whose induced subgraph does not contain isolated vertices. The minimal size of a total dominating set, the total domination number, is denoted by γt. The maximal size of an inclusionwise minimal total dominating set, the upper total domination num...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملPaired-domination in inflated graphs
The inflation GI of a graph G with n(G) vertices and m(G) edges is obtained from G by replacing every vertex of degree d of G by a clique Kd. A set S of vertices in a graph G is a paired dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired domination number γp(G) is the minimum cardinality of a paired d...
متن کاملThe Paired-domination and the Upper Paired-domination Numbers of Graphs
In this paper we continue the study of paired-domination in graphs. A paired–dominating set, abbreviated PDS, of a graph G with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G, denoted by γp(G), is the minimum cardinality of a PDS of G. The upper paired–domination number of G, denoted by Γp(G), is the maximum ca...
متن کاملComplexity of Comparing the Domination Number to the Independent Domination, Connected Domination, and Paired Domination Numbers
The domination number γ(G), the independent domination number ι(G), the connected domination number γc(G), and the paired domination number γp(G) of a graph G (without isolated vertices, if necessary) are related by the simple inequalities γ(G) ≤ ι(G), γ(G) ≤ γc(G), and γ(G) ≤ γp(G). Very little is known about the graphs that satisfy one of these inequalities with equality. I.E. Zverovich and V...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 1998
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1063